Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F2(a, y) -> G1(y)
F2(a, y) -> F2(y, g1(y))

The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F2(a, y) -> G1(y)
F2(a, y) -> F2(y, g1(y))

The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F2(a, y) -> F2(y, g1(y))

The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


F2(a, y) -> F2(y, g1(y))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(F2(x1, x2)) = x1 + x2   
POL(a) = 1   
POL(b) = 0   
POL(g1(x1)) = 0   

The following usable rules [14] were oriented:

g1(a) -> b
g1(b) -> b



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f2(a, y) -> f2(y, g1(y))
g1(a) -> b
g1(b) -> b

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.